On Efficient Models for Model Checking Message-Passing Distributed Protocols
نویسندگان
چکیده
The complexity of distributed algorithms, such as state machine replication, motivates the use of formal methods to assist correctness verification. The design of the formal model of an algorithm directly affects the efficiency of the analysis. Therefore, it is desirable that this model does not add “unnecessary” complexity to the analysis. In this paper, we consider a general message-passing (MP) model of distributed algorithms and compare different ways of modeling the message traffic. We prove that the different MP models are equivalent with respect to the common properties of distributed algorithms. Therefore, one can select the model which is best suited for the applied verification technique. We consider MP models which differ regarding whether (1) the event of message delivery can be interleaved with other events and (2) a computation event must consume all messages that have been delivered after the last computation event of the same process. For generalized MP distributed protocols and especially focusing on fault-tolerance, we show that our proposed model (without interleaved delivery events and with relaxed semantics of computation events) is significantly more efficient for explicit state model checking. For example, the model size of the Paxos algorithm is 1/13 that of existing equivalent MP models.
منابع مشابه
Accuracy of Message Counting Abstraction in Fault-Tolerant Distributed Algorithms
Fault-tolerant distributed algorithms are a vital part of mission-critical distributed systems. In principle, automatic verification can be used to ensure the absence of bugs in such algorithms. In practice however, model checking tools will only establish the correctness of distributed algorithms if message passing is encoded efficiently. In this paper, we consider abstractions suitable for ma...
متن کاملSHIFT+M: Software-Hardware Information Flow Tracking on Multi-core
We designed, implemented and analyzed three distributed protocols for information-flow tracking on a multi-core message-passing architecture. In each we used Asbestos style labels to provide protection from unauthorized communication. The protocols remove the reliance on a central repository for taint checking by adding a trusted library and hardware mechanisms at each core. We modeled the hard...
متن کاملDistributed Model Checking: From Abstract Algorithms to Concrete Implementations
Distributed Model Checking (Dmc) is based on several distributed algorithms, which are often complex and error prone. In this paper, we consider one fundamental aspect of Dmc design: message passing communication, the implementation of which presents hidden tradeoffs often dismissed in Dmc related literature. We show that, due to such communication models, high level abstract Dmc algorithms mig...
متن کاملToward Nex-Generation Middleware?
Let's define a distribution model as a set of mechanisms to handle distribution for example, distributed object computing, Remote Procedure Call, and message passing. Middleware specifications such as CORBA or Java Message Service propose the API and protocols to support these models. (For example, CORBA supports distributed object computing, and Java Message Service supports message passing.) ...
متن کاملDesign and Implementation of a Network Layer for Distributed Programming Platforms
This paper discuss the design, implementation and evaluation of a new network layer for Mozart. Mozart is one of the distributed programming platform which is based on the multi paradigm language namely Mozart supplies a factual network transparent implementation by maintaining network awareness, openness, and also fault tolerance. Its network layer provides message passing service to its highe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010